Task allocation onto a hypercube by recursive mincut bipartitioning
نویسندگان
چکیده
منابع مشابه
Task Allocation onto a Hypercube by Recursive
An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution ...
متن کاملTask Allocation onto a Hypercube
An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution ...
متن کاملModels for Scheduling Task Graphs onto Hypercube Systems
Given a set of m tasks with a precedence constraint P and a communication requirement C, where each task has execution time and a subcube requirement, the Hypercube Task Scheduling Problem (HTSP) is to nd an assignment of tasks which minimizes the total completion time. In this paper, we show that HTSP and its many restricted versions are NP-hard. This motivates the development of heuristic alg...
متن کاملOn Improving Recursive Bipartitioning-Based Placement
We present an improved partitioning-based placement tool in terms of the half-perimeter wirelength. In contrast to placement tools that exploit white spaces to reduce the routing congestion, our placement tool exploits white spaces to reduce the total wirelength. In particular, we generate white spaces during the legalization step and treat white spaces as pseudo cells during the detailed place...
متن کاملParallel Algorithms for Hypercube Allocation
Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies are easier to implement, their worst case time complexities exponentially increase as the dimension of the hypercube increases. We show that the free processors can be utilized t o perform the allocation jobs in parallel to improv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1990
ISSN: 0743-7315
DOI: 10.1016/0743-7315(90)90004-9